//cf
//https://codeforces.com/contest/1780/problem/A

//数学知识
//两个奇数加一个偶数==偶数(记住)


#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
const int N = 2e5 + 10;
#define INF 0x3f3f3f3f;
typedef long long int ll;
#define close(); std::ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
//----------------------------------------------------------------------------//
int n, a[310];
void solve()
{
	set<int> cnt;
	cin >> n;
	int odd = 0, even = 0;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
		if (a[i] & 1) odd++, cnt.insert(i);//这里可以不插入只记录的,下面就少个pos判定,铸币了
		else even++;
	}

	if (even == n || (even == 1 && odd == 2)) { cout << "NO" << '\n'; return; }
	else cout << "YES" << '\n';

	//for(auto&x:cnt) cout<<x<<" ";

	int sz = cnt.size();
	if (3 - sz > 0 && odd != 2)
	{
		sz = 3 - sz;
		for (int i = 1; i <= n; i++)
		{
			if (sz <= 0) break;
			if (a[i] % 2 == 0 && cnt.find(i) == cnt.end()) cnt.insert(i), sz--;
		}
	}
	else if (3 - sz > 0 && odd == 2)
	{
		cnt.clear();
		odd = 1, even = 2;
		for (int i = 1; i <= n; i++)
		{
			if (even <= 0 && odd <= 0) break;
			if (a[i] & 1 && odd > 0) cnt.insert(i), odd--;
			else if (a[i] % 2 == 0 && even > 0) cnt.insert(i), even--;
		}
	}

	int pos = 0;
	for (auto& x : cnt)
	{
		if (pos >= 3) break;
		cout << x << " ";
		pos++;
	}
	cout << '\n';


}

int main()
{
	close();
	int T; cin >> T;
	while (T--) solve();
	return 0;
}